Compound geometric approximation under a failure rate constraint

نویسنده

  • Fraser Daly
چکیده

We consider compound geometric approximation for a nonnegative, integervalued random variable W . The bound we give is straightforward but relies on having a lower bound on the failure rate of W . Applications are presented to M/G/1 queuing systems, for which we state explicit bounds in approximations for the number of customers in the system and the number of customers served during a busy period. Other applications are given to birth-death processes and Poisson processes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method

This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...

متن کامل

Non-Lipschitz Semi-Infinite Optimization Problems Involving Local Cone Approximation

In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.

متن کامل

Optimal Coding Subgraph Selection under Survivability Constraint

Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...

متن کامل

Ela Interest Zone Matrix Approximation

An algorithm for matrix approximation, when only some of its entries are taken into consideration, is described. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank approximations, this type of algorithms appears recently in the literature under different names, where it usually uses the Expectation-Maximization algorithm that maximizes...

متن کامل

A geometric-process maintenance model for a deteriorating system under a random environment

This paper studies a geometric-process maintenance-model for a deteriorating system under a random environment. Assume that the number of random shocks, up to time , produced by the random environment forms a counting process. Whenever a random shock arrives, the system operating time is reduced. The successive reductions in the system operating time are statistically independent and identicall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Applied Probability

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2016